Signature from a New Subgroup Assumption
نویسنده
چکیده
We present a new signature whose security is reducible to a new assumptions about subgroups, the Computational Conjugate Subgroup Members (CCSM) Assumption, in the random oracle model.
منابع مشابه
Identity-based quotable ring signature
We present a new notion of identity-based quotable ring signature. This new cryptographic primitive can be used to derive new ring signatures on substrings of an original message from an original ring signature on the original message, which is generated by the actual signer included in the ring. No matter whether a ring signature is originally generated or is quoted from another valid ring sig...
متن کاملConvertible limited (multi-) verifier signature: new constructions and applications
A convertible limited (multi-) verifier signature (CL(M)VS) provides controlled verifiability and preserves the privacy of the signer. Furthermore, limited verifier(s) can designate the signature to a third party or convert it into a publicly verifiable signature upon necessity. In this proposal, we first present a generic construction of convertible limited verifier signature (CLVS) into which...
متن کاملA New Short Signature Scheme Without Random Oracles from Bilinear Pairings
To date, there exist three short signature schemes from bilinear pairings. In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of our scheme depends on a new complexity assumption called the k+1 square roots assumption. We also discuss the relationship between the k+1 square roots assumption and som...
متن کاملA New Type of Group Signature Scheme
Abstract: On the basis of BB short signature scheme, this paper derives a new signature scheme, from which we construct a new kind of group signature scheme. The security of the new group signature scheme is based on the q-Strong Diffie-Hellman assumption and the Decisional Diffie-Hellman assumption in the random oracle model. The length of the new group signature is a little longer than that o...
متن کاملA New Signature Scheme Without Random Oracles from Bilinear Pairings
In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of the proposed scheme depends on a new complexity assumption called the k+1 square roots assumption. Moreover, the k+1 square roots assumption can be used to construct shorter signatures under the random oracle model.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2005 شماره
صفحات -
تاریخ انتشار 2005